Optimal Multiple Stopping with Random Waiting Times
نویسندگان
چکیده
منابع مشابه
Optimal Stopping with Random Intervention Times
We consider a class of optimal stopping problems where the ability to stop depends on exogenous Poisson signal process – one can only stop at the Poisson jump times. Even though the time variable in these problems has a discrete aspect, a variational inequality can be obtained by considering an underlying continuous time structure. Depending on whether stopping is allowed at t = 0, the value fu...
متن کاملOptimal Stopping with Multiple Priors
We develop a theory of optimal stopping under Knightian uncertainty. A suitable martingale theory for multiple priors is derived in order to extend the classical dynamic programming or Snell envelope approach to multiple priors. We relate the multiple prior theory to the classical setup via a minimax theorem. In a multiple prior version of the classical i.i.d. model we discuss several examples ...
متن کاملOptimal multiple stopping with sum-payoff
We consider the optimal stopping of independent, discrete time sequences X1, . . . , Xn where m stops are allowed. The payoff is the sum of the stopped values. Under the assumption of convergence of related imbedded point processes to a Poisson process in the plane we derive approximatively optimal stopping times and stopping values. The solutions are obtained via a system of m differential equ...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملOptimal Stopping Problem for Stochastic Differential Equations with Random Coefficients
An optimal stopping problem for stochastic differential equations with random coefficients is considered. The dynamic programming principle leads to a Hamiltion–Jacobi–Bellman equation, which, for the current case, is a backward stochastic partial differential variational inequality (BSPDVI, for short) for the value function. Well-posedness of such a BSPDVI is established, and a verification th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sequential Analysis
سال: 2013
ISSN: 0747-4946,1532-4176
DOI: 10.1080/07474946.2013.803814